Entropic Graphs for Manifold Learning
نویسنده
چکیده
We propose a new algorithm that simultaneously estimates the intrinsic dimension and intrinsic entropy of random data sets lying on smooth manifolds. The method is based on asymptotic properties of entropic graph constructions. In particular, we compute the Euclidean -nearest neighbors ( NN) graph over the sample points and use its overall total edge length to estimate intrinsic dimension and entropy. The algorithm is validated on standard synthetic manifolds.
منابع مشابه
On the Convexity of the Entropy along Entropic Interpolations
Convexity properties of the entropy along displacement interpolations are crucial in the Lott-Sturm-Villani theory of lower bounded curvature of geodesic measure spaces. As discrete spaces fail to be geodesic, an alternate analogous theory is necessary in the discrete setting. Replacing displacement interpolations by entropic ones allows for developing a rigorous calculus, in contrast with Otto...
متن کاملManifold Spanning Graphs
Graph construction is the essential first step for nearly all manifold learning algorithms. While many applications assume that a simple k-nearest or -close neighbors graph will accurately model the topology of the underlying manifold, these methods often require expert tuning and may not produce high quality graphs. In this paper, the hyperparameter sensitivity of existing graph construction m...
متن کاملبهبود مدل تفکیککننده منیفلدهای غیرخطی بهمنظور بازشناسی چهره با یک تصویر از هر فرد
Manifold learning is a dimension reduction method for extracting nonlinear structures of high-dimensional data. Many methods have been introduced for this purpose. Most of these methods usually extract a global manifold for data. However, in many real-world problems, there is not only one global manifold, but also additional information about the objects is shared by a large number of manifolds...
متن کاملSemi-Supervised Learning with Manifold Fitted Graphs
In this paper, we propose a locality-constrained and sparsity-encouraged manifold fitting approach, aiming at capturing the locally sparse manifold structure into neighborhood graph construction by exploiting a principled optimization model. The proposed model formulates neighborhood graph construction as a sparse coding problem with the locality constraint, therefore achieving simultaneous nei...
متن کاملRobust manifold learning with CycleCut
Many manifold learning algorithms utilize graphs of local neighborhoods to estimate manifold topology. When neighborhood connections short-circuit between geodesically distant regions of the manifold, poor results are obtained due to the compromises that the manifold learner must make to satisfy the erroneous criteria. Also, existing manifold learning algorithms have difficulty unfolding manifo...
متن کامل